Integrating Constraint Solving into
ثبت نشده
چکیده
منابع مشابه
Integrating Finite Domain and Set Constraints into a Set-based Constraint Language
This paper summarizes a constraint solving technique that is used to reason effectively in the scope of a set-based constraint language that supersedes existing finite domain languages. The first part of this paper motivates the presented work and introduces the constraint language, namely the language of Hereditarily Finite Sets (HFS). Then, the proposed constraint solver is detailed in terms ...
متن کاملAn example of integrating constraint programming and mathematical programming
This paper describes an integration of nite domain constraint programming techniques into mathematical programming, with an implementation of this new solution approach based on a commercial linear mixed-integer tool and a nite domain CP solver over unions of integer intervals. The combined modelling and problem solving approach has been applied to test problems of diierent types and dimensions...
متن کاملConstraint Answer Set Solving
We present a new approach to integrating Constraint Processing (CP) techniques into Answer Set Programming (ASP). Based on an alternative semantic approach, we develop an algorithmic framework for conflict-driven ASP solving that exploits CP solving capacities. A significant technical issue concerns the combination of conflict information from different solver types. We have implemented our app...
متن کاملACLP: Integrating Abduction and Constraint Solving
ACLP is a system which combines abductive reasoning and constraint solving by integrating the frameworks of Abductive Logic Programming (ALP) and Constraint Logic Programming (CLP). It forms a general highlevel knowledge representation environment for abductive problems in Artificial Intelligence and other areas. In ACLP, the task of abduction is supported and enhanced by its non-trivial integr...
متن کاملSolving A Fractional Program with Second Order Cone Constraint
We consider a fractional program with both linear and quadratic equation in numerator and denominator having second order cone (SOC) constraints. With a suitable change of variable, we transform the problem into a second order cone programming (SOCP) problem. For the quadratic fractional case, using a relaxation, the problem is reduced to a semi-definite optimization (SDO) program. The p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000